Optimal Linear Broadcast
نویسندگان
چکیده
As the communication lines and switching hardware in disoibuted networks become much faster, a new trend of algorithms is needed to utilize it. Traditional broadcast algorithm send one packet along each communication line at a time, and propagate it by replicating and sending it on all the outgoing lines. This method does not use the high bandwidth or the switching hardware, and it overloads the processor. Our routing algorithms send several packets simultaneously on one communication line, and each packet is sent along a linear route. In this paper we assume that the switching hardware has limited strength. We present .. algorithms that compute an optimal broadcast routing, using a bounded number of linear routes. We prove that a greedy algorithm solves the problem, and present an improved algorithm for the same problem. • T ec hn io n C om pu te r Sc ie nc e D ep ar tm en t T eh ni ca l R ep or t C S0 62 3 19 90
منابع مشابه
Optimal Index Codes via a Duality between Index Coding and Network Coding
In Index Coding, the goal is to use a broadcast channel as efficiently as possible to communicate information from a source to multiple receivers which can possess some of the information symbols at the source as side-information. In this work, we present a duality relationship between index coding (IC) and multiple-unicast network coding (NC). It is known that the IC problem can be represented...
متن کاملMinimal Time Broadcasting in Cognitive Radio Networks
This paper addresses time-efficient broadcast scheduling problem in Cognitive Radio (CR) Networks. Cognitive Radio is a promising technology that enables the use of unused spectrum in an opportunistic manner. Because of the unique characteristics of CR technology, the broadcast scheduling problem in CR networks needs unique solutions. Even for single channel wireless networks, finding a minimum...
متن کاملLinear Network Error Correction Multicast/Broadcast/Dispersion Codes
In this paper, for the purposes of information transmission and network error correction simultaneously, three classes of important linear network codes in network coding, linear multicast/broadcast/dispersion codes are generalized to linear network error correction coding, i.e., linear network error correction multicast/broadcast/dispersion codes. We further propose the (weakly, strongly) exte...
متن کاملCommunication algorithms with advice
We study the amount of knowledge about a communication network that must be given to its nodes in order to efficiently disseminate information. Our approach is quantitative: we investigate the minimum total number of bits of information (minimum size of advice) that has to be available to nodes, regardless of the type of information provided. We compare the size of advice needed to perform broa...
متن کاملOn the Broadcast Rate of Index Coding Problems with Symmetric and Consecutive Interference
A single unicast index coding problem (SUICP) with symmetric and consecutive interference (SCI) has K messages and K receivers, the kth receiver Rk wanting the kth message xk and having interference Ik = {xk−U−m, . . . , xk−m−2, xk−m−1}∪ {xk+m+1, xk+m+2, . . . , xk+m+D} and side-information Kk = (Ik∪xk) . In this paper, we derive a lowerbound on the broadcast rate of single unicast index coding...
متن کاملThe Benefit of Limited Feedback to Generation-Based Random Linear Network Coding in Wireless Broadcast
Random linear network coding (RLNC) is asymptotically throughput optimal in the wireless broadcast of a block of packets from a sender to a set of receivers, but suffers from heavy computational load and packet decoding delay. To mitigate this problem while maintaining good throughput, we partition the packet block into disjoint generations after broadcasting the packets uncoded once and collec...
متن کامل